Dynamic Lot-Sizing Model With a Class of Multi-Breakpoint Discount Cost Structures∗
نویسندگان
چکیده
In this paper, we consider a class of single-item dynamic lot-sizing problem with quantity discount cost structure. We present an optimal polynomial algorithm for the case of multibreakpoint Ni, i = 1,2, . . . ,m. The complexity of our algorithm is O(n3 + mn2), where n is the number of periods in finite planning horizon.
منابع مشابه
OPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
متن کاملModeling and Analyzing Incremental Quantity Discounts in Transportation Costs for a Joint Economic Lot Sizing Problem
Joint economic lot sizing (JELS) addresses integrated inventory models in a supply chain. Most of the studies in this field either do not consider the role of the transportation cost in their analysis or consider transportation cost as a fixed part of the ordering costs. In this article, a model is developed to analyze an incremental quantity discount in transportation cost. Appropriate equatio...
متن کاملA Multi-objective Mathematical Model for Sustainable Supplier Selection and Order Lot-Sizing under Inflation
Recently, scholars and practitioners have shown an increased interest in the field of sustainable supplier selection and order lot-sizing. While several studies have recently carried out on this field, far too little attention has been given to formulating a multi-objective model for the integrated problem of multi-period multi-product order lot-sizing and sustainable supplier selection under i...
متن کاملA Multi-level Capacitated Lot-sizing Problem with Safety Stock Deficit and Production Manners: A Revised Simulated Annealing
[1] Corresponding author e-mail: [email protected] [1] Corresponding author e-mail: [email protected] Lot-sizing problems (LSPs) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. This paper aims at developing a new mathematical model for the multi-level ca...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کامل